Graph / Hamiltonian cycle (Bibtex)

P417: Enumeration of all Hamiltonian circuits in a graph

Input:

A graph $G$.

Output:

All Hamiltonian circuits in $G$.

Complexity:

Comment:

Reference:

[Yau1967] (Bibtex)

P466: Enumerate $h$ hamiltonian cycles in a graph.

Input:

A graph $G$ and an integer $h$.

Output:

$h$ hamiltonian cycles in $G$.

Complexity:

Comment:

Reference:

[Martello1983] (Bibtex)

P246: Enumeration of all Hamiltonian cycles in a graph

Input:

A graph $G$.

Output:

All Hamiltonian cycles in $G$.

Complexity:

Comment:

Reference:

[Wild2008] (Bibtex)